#ifndef __LINKEDSTACK_H__
#define __LINKEDSTACK_H__
#include <stdbool.h>
typedef int SElemType;
struct Node// 链式栈 数据节点类型
{
    SElemType data;
    struct Node*pre;
    struct Node*next;
};
struct LinkedStack// 链式栈
{
    int num;
    struct Node*bottom;//栈底指针  可要可不要看自己具体情况
    struct Node*top;//栈顶指针
};

extern struct LinkedStack*Create_Stack();
extern bool Clear_Stack(struct LinkedStack*s);
extern bool Destroy_Stack(struct LinkedStack*s);
extern bool Is_Empty(struct LinkedStack*s);
extern int Get_Length(struct LinkedStack*s);
extern bool Pop(struct LinkedStack*s, SElemType* d);
extern bool Push(struct LinkedStack*s, SElemType d);
extern bool Get_Top(struct LinkedStack*s, SElemType* d);

#endif
